Multidimensional interval routing schemes
نویسندگان
چکیده
منابع مشابه
Multi-Dimensional Interval Routing Schemes
Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas k...
متن کاملMulti-dimensional Interval Routing Schemes
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-eÆcient routing strategy for routing messages in a network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link l at a no...
متن کاملLow Congested Interval Routing Schemes
In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterries, wrapped butterries and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already suucient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. More...
متن کاملInterval Routing Schemes for Circular-Arc Graphs
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively sh...
متن کاملOn Interval Routing Schemes and Treewidth
In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each fixed k ≥ 1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00070-4